Supereulerian Graphs and the Petersen Graph
نویسندگان
چکیده
منابع مشابه
Supereulerian Graphs and the Petersen Graph
A graph G is called even if O(G)=<, and G is called eulerian if G is even and connected. If G has a spanning eulerian subgraph, then G is called supereulerian, and we write G # SL. Tutte [19, 20] and Matthews [17] conjectured that if a 2-edge-connected graph G has no subgraph contractible to the Petersen graph, then G has a 3-colorable double cycle cover (i.e., a collection of three even subgra...
متن کاملSupereulerian graphs and matchings
A graph G is called supereulerian if G has a spanning Eulerian subgraph. Let α(G) be the maximum number of independent edges in the graph G. In this paper, we show that if G is a 2-edge-connected simple graph and α(G) ≤ 2, then G is supereulerian if and only if G is not K2,t for some odd number t . © 2011 Elsevier Ltd. All rights reserved.
متن کاملSupereulerian graphs in the graph family C2(6, k)
For integers l and k with l > 0, and k ≥ 0, Ch(l, k) denotes the collection of h-edgeconnected simple graphs G on n vertices such that for every edge-cut X with 2 ≤ |X | ≤ 3, each component of G − X has at least (n − k)/l vertices. We prove that for any integer k > 0, there exists an integer N = N(k) such that for any n ≥ N , any graph G ∈ C2(6, k) on n vertices is supereulerian if and only if ...
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملAddressing the Petersen graph
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N -tuples of three symbols in such a way that distances between vertices may readily be determined from their addresses. They observed that N ≥ h(D), the maximum of the number of positive and the number of negative eigenvalues of the distance matri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1996
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.0009